DP-4-coloring of planar graphs with some restrictions on cycles
نویسندگان
چکیده
DP-coloring was introduced by Dvo\v{r}\'{a}k and Postle as a generalization of list coloring. It originally used to solve longstanding conjecture Borodin, stating that every planar graph without cycles lengths 4 8 is 3-choosable. In this paper, we give three sufficient conditions for be DP-4-colorable. Actually all the results (Theorem 1.3, 1.4 1.7) are stated in ``color extendability'' form, uniformly proved vertex identification discharging method.
منابع مشابه
Total coloring of planar graphs without some chordal 6-cycles
A k-total-coloring of a graph G is a coloring of vertex set and edge set using k colors such that no two adjacent or incident elements receive the same color. In this paper, we prove that if G is a planar graph with maximum ∆ ≥ 8 and every 6-cycle of G contains at most one chord or any chordal 6-cycles are not adjacent, then G has a (∆ + 1)-total-coloring.
متن کاملEquitable ∆-Coloring of Planar Graphs without 4-cycles
In this paper, we prove that if G is a planar graph with maximum degree ∆ ≥ 7 and without 4-cycles, then G is equitably m-colorable for any m≥ ∆.
متن کاملColoring squares of planar graphs with no short cycles
Wang and Lih conjectured that for every g ≥ 5, there exists a number M(g) such that the chromatic number of the square of every planar graph of girth at least g and maximum degree ∆ ≥ M(g) is ∆ + 1. We disprove the conjecture for g ∈ {5, 6} and prove the existence of the number M(g) for g ≥ 7. More generally, we show that every planar graph of girth at least 7 and maximum degree ∆ ≥ 190 + 2dp/q...
متن کاملList-Coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles
Let G be a planar graph without 4-cycles and 5-cycles and with maximum degree ∆ ≥ 32. We prove that χ`(G ) ≤ ∆ + 3. For arbitrarily large maximum degree ∆, there exist planar graphs G∆ of girth 6 with χ(G 2 ∆) = ∆ + 2. Thus, our bound is within 1 of being optimal. Further, our bound comes from coloring greedily in a good order, so the bound immediately extends to online list-coloring. In additi...
متن کاملA note on the total coloring of planar graphs without adjacent 4-cycles
In this paper, all graphs are finite, simple and undirected. Any undefined notation follows that of Bondy and Murty [2]. Let G be a graph, We use V (G), E(G), ∆(G) and δ (G) (or simplyV , E, ∆ and δ ) to denote the vertex set, the edge set, the maximum(vertex) degree and the minimum (vertex) degree of G, respectively. A k-, k+or k−vertex is a vertex of degree k, at least k, or at most k, respec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112568